-
1 sparsity ordering
-
2 схема хранения разреженных данных
Makarov: sparsity orderingУниверсальный русско-английский словарь > схема хранения разреженных данных
-
3 упорядочение разрежённости
Makarov: sparsity orderingУниверсальный русско-английский словарь > упорядочение разрежённости
-
4 формат хранения разреженных данных
Makarov: sparsity orderingУниверсальный русско-английский словарь > формат хранения разреженных данных
См. также в других словарях:
Sparsity-of-effects principle — The sparsity of effects principle states that a system is usually dominated by main effects and low order interactions. Thus it is most likely that main (single factor) effects and two factor interactions are the most significant responses (see… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
List of statistics topics — Please add any Wikipedia articles related to statistics that are not already on this list.The Related changes link in the margin of this page (below search) leads to a list of the most recent changes to the articles listed below. To see the most… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia